Pii: S0031-3203(96)00191-4
نویسندگان
چکیده
-In this work we present two new algorithms for the detection of circles and ellipses which use the FHT algorithm as a basis: Fast Circle Hough Transform (FCHT) and Fast Ellipse Hough Transform (FEHT). The first stage of these two algorithms, devoted to obtaining the centers of the figures, is computationally the most costly. With the objective of improving the execution times of this stage it has been implemented using a new focusing algorithm instead of the typical polling process in a parameter space. This new algorithm uses a new strategy that manages to reduce the execution times, especially in the case where multiple figures appear in the image, or when they are of very different sizes. We also perform a labeling of the image points that permits discriminating which of these belong to each figure, saving computations in subsequent stages. © 1997 Pattern Recognition Society. Published by Elsevier Science Ltd. Hough transform Circle and ellipse detection Decoupling of parameters Irregular computation Focusing algorithm
منابع مشابه
Lower order circle and ellipse Hough transform
In this work we present two new algorithms for the detection of circles and ellipses which use the FHT algorithm as a basis: Fast Circle Hough Transform (FCHT) and Fast Ellipse Hough Transform (FEHT). The first stage of these two algorithms, devoted to obtaining the centers of the figures, is computationally the most costly. With the objective of improving the execution times of this stage it h...
متن کاملAn expert system for general symbol recognition
An expert system for analysis and recognition of general symbols is introduced. The system uses the structural pattern recognition technique for modeling symbols by a set of straight lines referred to as segments. The system rotates, scales and thins the symbol, then extracts the symbol strokes. Each stroke is transferred into segments (straight lines). The system is shown to be able to map sim...
متن کاملPii: S0031-3203(96)00148-3
-This paper presents a new algorithm for extracting IF-THEN rules from examples. The algorithm employs an efficient rule searching method and a simple metric for assessing rule generality and accuracy. The paper illustrates step by step the operation of the algorithm and discusses its performance on the IRIS data classification problem. © 1997 Pattern Recognition Society. Published by Elsevier ...
متن کاملSegmentation and recognition of connected handwritten numeral strings
-A new segmentation method for segmenting connected handwritten digit strings is presented. Unlike traditional methods where segmentation points are uniquely determined to cut the piece of stroke joining the connected numerals, our approach is one of identifying regions which serve as potential segmentation points. The regions are identified by a thorough analysis of the trajectory of strokes.....
متن کاملDeformable prototypes for encoding shape categories in image databases
We describe a method for shape-based image database search that uses deformable prototypes to represent categories. Rather than directly comparing a candidate shape with all shape entries in the database, shapes are compared in terms of the types of nonrigid deformations (differences) that relate them to a small subset of representative prototypes. To solve the shape correspondence and alignmen...
متن کامل